Permutation binomials over finite fields
نویسندگان
چکیده
منابع مشابه
Permutation Binomials over Finite Fields
We prove that if xm + axn permutes the prime field Fp, where m > n > 0 and a ∈ Fp, then gcd(m − n, p − 1) > √ p − 1. Conversely, we prove that if q ≥ 4 and m > n > 0 are fixed and satisfy gcd(m − n, q − 1) > 2q(log log q)/ log q, then there exist permutation binomials over Fq of the form xm + axn if and only if gcd(m,n, q − 1) = 1.
متن کاملNew classes of permutation binomials and permutation trinomials over finite fields
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinational design, communication theory and so on. Permutation binomials and trinomials attract people’s interest due to their simple algebraic form and additional extraordinary properties. In t...
متن کاملSome New Permutation Polynomials over Finite Fields
In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...
متن کاملSpecific permutation polynomials over finite fields
We present new classes of permutation polynomials over finite fields. If q is the order of a finite field, some polynomials are of form xrf(x(q−1)/d), where d|(q − 1). Other permutation polynomials are related with the trace function. 2000 Mathematics Subject Classification: Primary 11T06.
متن کاملOn some permutation polynomials over finite fields
Let Fq be a finite field of q = pm elements with characteristic p. A polynomial P(x) ∈ Fq[x] is called a permutation polynomial of Fq if P(x) induces a bijective map from Fq to itself. In general, finding classes of permutation polynomials of Fq is a difficult problem (see [3, Chapter 7] for a survey of some known classes). An important class of permutation polynomials consists of permutation p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2009
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-09-04578-4